Formal languages - PDFSEARCH.IO - Document Search Engine

Formal languages
Results: 2429

#	Item
681	 8    Parsing is the process of converting an unstructured input, such as a text file, into Add to Reading List Source URL: hop.perl.plover.com Language: English - Date: 2008-12-09 12:52:22 Compiler construction Formal languages Regular expressions Scripting languages Lexical analysis Parsing Lex Newline String Computing Software engineering Software
682	Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2001-05-28 19:28:08 Science Grammar Treebank Chart parser Parsing Bottom-up parsing Stochastic context-free grammar Formal grammar Context-free grammar Formal languages Linguistics Compiler construction
683	The Starring Role of Quantifiers in the History of Formal Semantics Barbara H. Partee. Abstract The history of formal semantics is a history of evolving ideas about logical form, linguistic form, and the nature of semant Add to Reading List Source URL: udrive.oit.umass.edu Language: English - Date: 2013-01-08 16:19:32 Science Philosophy of language Formal languages Quantification Grammar Intensional logic Generalized quantifier Mathematical logic First-order logic Logic Semantics Linguistics
684	HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars ADAM KIEZUN, Brigham and Women’s Hospital / Harvard Medical School VIJAY GANESH, Massachusetts Institute of Technology SHA Add to Reading List Source URL: pgbovine.net Language: English - Date: 2014-01-03 23:24:44 Theoretical computer science SQL injection SQL Hampi Context-free grammar String Constraint programming Boolean satisfiability problem Formal grammar Formal languages Computing Software engineering
685	Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2011-09-27 14:42:30 Applied mathematics Automata theory EXPSPACE Regular language Regular expression Model theory PSPACE-complete FO Symbol Theoretical computer science Formal languages Complexity classes
686	Regular Expressions for Data Words Leonid Libkin and Domagoj Vrgoˇc School of Informatics, University of Edinburgh Abstract. In data words, each position carries not only a letter form a finite alphabet, as the usual wo Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-04 06:54:58 Mathematics Combinatorics String Regular language Regular expression Symbol Ω-automaton Formal languages Automata theory Theoretical computer science
687	Advanced Algorithms – COMS31900Lecture 8 Suffix Trees Benjamin Sach Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:19 Computing Dynamic programming String matching algorithms Pattern matching String FO Substring Approximate string matching Knuth–Morris–Pratt algorithm Theoretical computer science Mathematics Formal languages
688	Traitor-Tracing on Binary Strings Michael J. Collins Sandia National Laboratories⋆ Albuquerque, NM USA 87185 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-23 13:49:52 Formal languages Mathematics Longest common substring problem Substring Linguistics Orbifold Comparison of programming languages Combinatorics String Dynamic programming
689	Faster Algorithms for Computing Longest Common Increasing Subsequences Gerth Stølting Brodal Kanela Kaligosi Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-07 08:09:04 Formal languages Longest increasing subsequence Subsequence Longest common subsequence problem Ordinal number Ordinal arithmetic Mathematics Dynamic programming Combinatorics
690	Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-07 01:33:40 String Combinatorics NP-complete problems Formal languages Substring Longest common subsequence problem Subsequence Approximate string matching String searching algorithm Mathematics Dynamic programming Theoretical computer science

UPDATE